The Journal of the Indian Mathematical Society

Santosh Kumar ¹

Affiliations
1 A. R. D. E., Kirkee, Poona-3., IN

Abstract

A familiar type of puzzle, classified in the books on mathematical recreations as "difficult crossing" has been generalised and solved by the application of Dynamic Programming by R. Bellman [1]. The object of this paper is to point out that the theory of Dynamic Programming can solve a still more general form of the problem.

Full Text

     

M. Imdad ¹, Santosh Kumar ¹

Affiliations
1 Department of Mathematics, Aligarh Muslim University, Aligarh-202002 (U.P), IN

Abstract

Using suitable conditions of weak commutativity we prove fixed point theorems for two pairs of nonself-mappings which generalize earlier known results due to Rhoades and Som et al. An illustrative example and application are also discussed.

Keywords

Metrically Convex Metric Space, Weak Commutativity, Compatible Mapping, R-Weak Commutativity, Complete Metric Space, Banach Space.

Full Text

     

D. R. Sahu ¹, M. Imdad ², Santosh Kumar ²

Affiliations
1 Department of Applied Mathematics, Shri Shankaracharya College of Engineering, Junwani, Bhilai-490 020 (M.P.)
2 Department of Mathematics, Aligarh Muslim University, Aligarh-202 002 (U.R), IN

Abstract

Fixed Point Iteration Process for Nonlipschitzian Nearly Nonexpansive Mappings.

Keywords

Mann and Ishikawa Iteration Processes, Opial's Condition, Asymptotically Quasi-Nonexpansive Mappings.

Full Text